Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width
نویسندگان
چکیده
Motivated by the ‘subgraphs world’ view of the ferromagnetic Ising model, we develop a general approach to studying mixing times of Glauber dynamics based on subset expansion expressions for a class of graph polynomials. With a canonical paths argument, we demonstrate that the chains defined within this framework mix rapidly upon graphs of bounded tree-width. This extends known results on rapid mixing for the Tutte polynomial, the adjacency-rank (R2-)polynomial and the interlace polynomial.
منابع مشابه
Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width
Motivated by the ‘subgraphs world’ view of the ferromagnetic Ising model, we analyse the mixing times of Glauber dynamics based on subset expansion expressions for classes of graph, hypergraph and matroid polynomials. With a canonical paths argument, we demonstrate that the chains defined within this framework mix rapidly upon graphs, hypergraphs and matroids of bounded tree-width. This extends...
متن کاملMatrix norms and rapid mixing for spin systems
We give a systematic development of the application of matrix norms to rapid mixing in spin systems. We show that rapid mixing of both random update Glauber dynamics and systematic scan Glauber dynamics occurs if any matrix norm of the associated dependency matrix is less than 1. We give improved analysis for the case in which the diagonal of the dependency matrix is 0 (as in heat bath dynamics...
متن کاملGlauber Dynamics on Hyperbolic Graphs: Boundary Conditions and Mixing Time
We study a continuous time Glauber dynamics reversible with respect to the Ising model on hyperbolic graphs and analyze the effect of boundary conditions on the mixing time. Specifically, we consider the dynamics on an n-vertex ball of the hyperbolic graph H(v, s), where v is the number of neighbors of each vertex and s is the number of sides of each face, conditioned on having (+)-boundary. If...
متن کاملVery rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs
Recent results have shown that the Glauber dynamics for graph colourings has optimal mixing time when (i) the graph is triangle-free and D-regular and the number of colours k is a small constant fraction smaller than 2D, or (ii) the graph has maximum degree D and k = 2D. We extend both these results to prove that the Glauber dynamics has optimal mixing time when the graph has maximum degree D a...
متن کاملDobrushin Conditions and Systematic Scan
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parameters bounding these influences — α, the total influence on a site, as studied by Dobrushin; α′, the total influence of a site, as studied by Dobrushin and Shlosman; and α′′, the total influence of a site in any given c...
متن کامل